Non-FPT lower bounds for structural restrictions of decision DNNF
نویسندگان
چکیده
We give a non-FPT lower bound on the size of structured decision DNNF and OBDD with decomposable AND-nodes representing CNFformulas of bounded incidence treewidth. Both models are known to be of FPT size for CNFs of bounded primal treewidth. To the best of our knowledge this is the first parameterized separation of primal treewidth and incidence treewidth for knowledge compilation models.
منابع مشابه
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
We introduce a top-down compilation algorithm for constructing structured DNNF for any Boolean function. With appropriate restrictions, the algorithm can produce various subsets of DNNF such as deterministic DNNF and OBDD. We derive a size upper bound for structured DNNF based on this algorithm and use the result to generalize similar upper bounds known for several Boolean functions in the case...
متن کاملLower Bounds for Exact Model Counting and Applications in Probabilistic Databases
The best current methods for exactly computing the number of satisfying assignments, or the satisfying probability, of Boolean formulas can be seen, either directly or indirectly, as building decision-DNNF (decision decomposable negation normal form) representations of the input Boolean formulas. Decision-DNNFs are a special case of dDNNFs where d stands for deterministic. We show that any deci...
متن کاملQuasipolynomial Simulation of DNNF by a Non-determinstic Read-Once Branching Program
We prove that DNNFs can be simulated by Non-deterministic ReadOnce Branching Programs (NROBPs) of quasi-polynomial size. As a result, all the exponential lower bounds for NROBPs immediately apply for DNNFs.
متن کاملW-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications
The notion of linear fpt-reductions has been recently used to derive strong computational lower bounds for well-known NP-hard problems. In this paper, we formally investigate the notions of W [t]-hardness and W [t]-completeness under the linear fpt-reduction, and study structural properties of the corresponding complexity classes. Additional complexity lower bounds on important computational pr...
متن کاملOn the Use of Partially Ordered Decision Graphs for Knowledge Compilation and Quantified Boolean Formulae∗
Decomposable Negation Normal Form formulae (DNNFs) form an interesting propositional fragment, both for efficiency and succinctness reasons. A famous subclass of the DNNF fragment is the OBDD fragment which offers many polytime queries and transformations, including quantifier eliminations (under some ordering restrictions). Nevertheless, the decomposable AND nodes at work in OBDDs enable only ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1708.07767 شماره
صفحات -
تاریخ انتشار 2017